Thermodynamic Constraints on DNA-based Computing
نویسندگان
چکیده
Computing with biological macromolecules, such as DNA, is fundamentally a physical/chemical process. The DNA chemistry introduces a level of complexity that makes reliable, e cient, and scalable computations a challenge. All the chemical and thermodynamic factors have to be analyzed and controlled in order for the molecular algorithm to produce the intended result. For instance, a computation based on DNA requires that the problem instance be encoded in single strands of DNA and that these strands react as planned, that molecular biology protocols, such as PCR or a nity separation, correctly extract the result, and that su cient exibility remains so that worthwhile computations can be done. In this paper, various thermodynamic and chemical constraints on DNA computing are enumerated. A similarity measure, based on Gibb's free energy of formation, is de ned to judge the goodness of DNA encodings. Finally, the DNA computation problem for implementing molecular algorithms is de ned, and it is likely that it is as di cult as the combinatorial optimization problems they are intended to solve.
منابع مشابه
A Novel Constraint for Thermodynamically Designing DNA Sequences
Biotechnological and biomolecular advances have introduced novel uses for DNA such as DNA computing, storage, and encryption. For these applications, DNA sequence design requires maximal desired (and minimal undesired) hybridizations, which are the product of a single new DNA strand from 2 single DNA strands. Here, we propose a novel constraint to design DNA sequences based on thermodynamic pro...
متن کاملDesign of DNA Coding Based on Immune Clone Selection Algorithm
In DNA computing, the design of DNA code is the most important step. The definition of DNA code, the constraints of DNA encoding and the corresponding formula are firstly described in this article, and then the design of DNA encoding based on immune clone algorithm is introduced. Simulation experiments show that DNA molecular chains that satisfy specific constraints and the corresponding thermo...
متن کاملFault Tolerant DNA Computing Based on Digital Microfluidic Biochips
Historically, DNA molecules have been known as the building blocks of life, later on in 1994, Leonard Adelman introduced a technique to utilize DNA molecules for a new kind of computation. According to the massive parallelism, huge storage capacity and the ability of using the DNA molecules inside the living tissue, this type of computation is applied in many application areas such as me...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملA Clustering Approach to Scientific Workflow Scheduling on the Cloud with Deadline and Cost Constraints
One of the main features of High Throughput Computing systems is the availability of high power processing resources. Cloud Computing systems can offer these features through concepts like Pay-Per-Use and Quality of Service (QoS) over the Internet. Many applications in Cloud computing are represented by workflows. Quality of Service is one of the most important challenges in the context of sche...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998